The finite embeddability property for some noncommutative knotted extensions of FL
نویسنده
چکیده
Alten proved in [4] that the FEP holds for commutative residuated lattices that satisfy any knotted rule. A class of algebras K is said to have the FEP, if for every algebra A in K and every finite partial subalgebra B of A, there exists a finite algebra D in K such that B embeds into D. B is a finite partial subalgebra of A, if B is a finite subset of A and each n−ary operation f on A induces a partial operation f on B defined as:
منابع مشابه
On n-contractive fuzzy logics
It is well known that MTL satisfies the finite embeddability property. Thus MTL is complete w.r.t. the class of all finite MTL-chains. In order to reach a deeper understanding of the structure of this class, we consider the extensions of MTL by adding the generalized contraction since each finite MTL-chain satisfies a form of this generalized contraction. Simultaneously, we also consider extens...
متن کاملDistributive residuated frames and generalized bunched implication algebras
We show that all extensions of the (non-associative) Gentzen system for distributive full Lambek calculus by simple structural rules have the cut elimination property. Also, extensions by such rules that do not increase complexity have the finite model property, hence many subvarieties of the variety of distributive residuated lattices have decidable equational theories. For some other extensio...
متن کاملSemisimplicity, Amalgamation Property and Finite Embeddability Property of Residuated Lattices
In this thesis, we study semisimplicity, amalgamation property and finite embeddability property of residuated lattices. We prove semisimplicity and amalgamation property of residuated lattices which are of purely algebraic character, by using proof-theoretic methods and results of substructural logics. On the other hand, we show the finite model property (FMP) for various substructural logics,...
متن کاملDecidability of Cancellative Extension of Monoidal T-norm Based Logic
It is known that the monoidal t-norm based logic (MTL) and many of its schematic extensions are decidable. The usual way how to prove decidability of some schematic extension of MTL is to show that the corresponding class of algebras of truth values has the finite model property (FMP) or the finite embeddability property (FEP). However this method does not work for the extensions whose correspo...
متن کاملFinite embeddability property for residuated groupoids
A very simple proof of the finite embeddability property for residuated distributivelattice-ordered groupoids and some related classes of algebras is presented. In particular, this gives an answer to the question posed in [3, Problem 4.2]. The presented construction allows for improvement of the upper bound on the complexity of the decision procedure for the universal theory of residuated distr...
متن کامل